Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(X) |
→ if(X,c,n__f(n__true)) |
| 2: |
|
if(true,X,Y) |
→ X |
| 3: |
|
if(false,X,Y) |
→ activate(Y) |
| 4: |
|
f(X) |
→ n__f(X) |
| 5: |
|
true |
→ n__true |
| 6: |
|
activate(n__f(X)) |
→ f(activate(X)) |
| 7: |
|
activate(n__true) |
→ true |
| 8: |
|
activate(X) |
→ X |
|
There are 5 dependency pairs:
|
| 9: |
|
F(X) |
→ IF(X,c,n__f(n__true)) |
| 10: |
|
IF(false,X,Y) |
→ ACTIVATE(Y) |
| 11: |
|
ACTIVATE(n__f(X)) |
→ F(activate(X)) |
| 12: |
|
ACTIVATE(n__f(X)) |
→ ACTIVATE(X) |
| 13: |
|
ACTIVATE(n__true) |
→ TRUE |
|
The approximated dependency graph contains one SCC:
{9-12}.
-
Consider the SCC {9-12}.
The constraints could not be solved.
Tyrolean Termination Tool (0.05 seconds)
--- May 3, 2006